Completely decomposable groups which admit only nilpotent multiplications
نویسندگان
چکیده
منابع مشابه
Computable Completely Decomposable Groups
A completely decomposable group is an abelian group of the form ⊕ i Hi, where Hi ≤ (Q,+). We show that every computable completely decomposable group is ∆5-categorical. We construct a computable completely decomposable group which is not ∆4-categorical, and give an example of a computable completely decomposable group G which is ∆4-categorical but not ∆3-categorical. We also prove that the inde...
متن کاملGroups Which Do Not Admit Ghosts
A ghost in the stable module category of a group G is a map between representations of G that is invisible to Tate cohomology. We show that the only non-trivial finite p-groups whose stable module categories have no non-trivial ghosts are the cyclic groups C2 and C3. We compare this to the situation in the derived category of a commutative ring. We also determine for which groups G the second p...
متن کاملWhich Finitely Generated Abelian Groups Admit Equal Growth Functions?
We show that finitely generated Abelian groups admit equal growth functions with respect to symmetric generating sets if and only if they have the same rank and the torsion parts have the same parity. In contrast, finitely generated Abelian groups admit equal growth functions with respect to monoid generating sets if and only if they have same rank. Moreover, we show that the size of the torsio...
متن کاملWhich Finitely Generated Abelian Groups Admit Isomorphic Cayley Graphs?
We show that Cayley graphs of finitely generated Abelian groups are rather rigid. As a consequence we obtain that two finitely generated Abelian groups admit isomorphic Cayley graphs if and only if they have the same rank and their torsion parts have the same cardinality. The proof uses only elementary arguments and is formulated in a geometric language.
متن کاملNilpotent Groups
The articles [2], [3], [4], [6], [7], [5], [8], [9], [10], and [1] provide the notation and terminology for this paper. For simplicity, we use the following convention: x is a set, G is a group, A, B, H, H1, H2 are subgroups of G, a, b, c are elements of G, F is a finite sequence of elements of the carrier of G, and i, j are elements of N. One can prove the following propositions: (1) ab = a · ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1974
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1974.53.273